Distributed Core Multicast (DCM): a multicast routing protocol for many groups with few receivers

We present a multicast routing protocol called Distributed Core Multicast (DCM). It is intended for use within a large single Internet domain network with a very large number of multicast groups with a small number of receivers. Such a case occurs, for example, when multicast addresses are allocated to mobile hosts, as a mechanism to manage Internet host mobility or in large distributed simulations. For such cases, existing dense or sparse mode multicast routing algorithms do not scale well with the number of multicast groups. DCM is based on an extension of the centre-based tree approach. It uses several core routers, called Distributed Core Routers (DCRs) and a special control protocol among them. DCM aims: (1) avoiding multicast group state information in backbone routers, (2) avoiding triangular routing across expensive backbone links, (3) scaling well with the number of multicast groups. We evaluate the performance of DCM and compare it to an existing sparse mode routing protocol when there is a large number of small multicast groups. We also analyse the behaviour of DCM when the number of receivers per group is not a small number

Scalable IP multicast for many very small groups with many senders and its application to mobility

We consider the problem of multicast routing in a large single domain network with a very large number of multicast groups with small number of receivers. Such a case occurs, for example, when multicast addresses are statically allocated to mobile terminals, as a mechanism to manage Internet host mobility. For such networks, existing dense or sparse mode multicast routing algorithms do not scale well with the number of multicast groups. We propose an alternative solution called Distributed Core Multicast (DCM) that is based on an extension of the centre-based tree approach. We also describe how our approach can be used to support mobile terminals

Anchored Path Discovery in Terminode Routing

Terminode routing, defined for potentially very large mobile ad hoc networks, forwards packets along anchored paths. An anchored path is a list of fixed geographic points, called anchors. Given that geographic points do not move, the advantage to traditional routing paths is that an anchored path is alway

Terminode Routing - A Scalable Routing Scheme for Large Mobile Ad Hoc Networks

No abstrac

The Asymmetric Best-Effort Service

We present Asymmetric Best-Effort, a novel service to provide a ``throughput versus delay jitter`` differentiated service for IP packets. With this service, every best effort packet is marked as either green or blue. Green packets, typically sent by real-time applications such as interactive audio, receive more losses during bouts of congestion than blue ones. In return, they receive less delay jitter. Both green and blue services are best-effort. The incentive to choose one or other is based on the nature of one`s traffic and on traffic conditions. If applications are TCP-friendly, an application sending blue packets will receive more throughput but also more delay jitter, than it would if it sent green packets for a given network state and path. Service provision at each cooperating router can be achieved by Packet Admission Control (PAC) and scheduling. We develop and simulate an initial algorithm that supports this service. It uses a modified version of RED for packet drop differention while scheduling of blue and green packets is facilated using Earliest Deadline First (EDF). These first results show the feasiblity of the service

Self Organized Terminode Routing - Version 2

We consider the problem of routing in a wide area mobile ad hoc network called Terminode Network. Routing in this network is designed with the following objectives. First, it should scale well in terms of the number of nodes and geographical coverage; second, routing should have scalable mechanisms that cope with the dynamicity in the network due to mobility; and third, nodes need to be highly collaborative and redundant, but, most of all, cannot use complex algorithms or protocols. Our routing scheme is a combination of two protocols called Terminode Local Routing (TLR) and Terminode Remote Routing (TRR). TLR is used to route packets to close destinations. TRR is used to route to remote destinations and is composed of the following elements: Geodesic Packet Forwarding (GPF), Anchored Geodesic Packet Forwarding (AGPF), Friend Assisted Path Discovery (FAPD), multipath routing and path maintenance. The combination of TLR and TRR has the following features: (1) it is highly scalable because every node relies only on itself and a small number of other nodes for packet forwarding; (2) it acts and reacts well to the dynamicity of the network because as a rule multipath routing is considered; and (3) it can be implemented and run in very simple devices because the algorithms and protocols are very simple and based on high collaboration. We performed simulations of the TLR and TRR protocols using the GloMoSim simulator. The simulation results for a large, highly mobile ad-hoc environment demonstrate benefits of the combination of TLR and TRR over an existing protocol that uses geographical information for packet forwarding

Self Organized Terminode Routing

We consider the problem of routing in a wide area mobile ad-hoc network called Terminode Network. Routing in such a network is designed with the following objectives. Firstly, it should scale well in terms of the number of nodes and geographical coverage, secondly, routing should have scalable mechanisms that cope with the dynamicity in the network due to mobility, and thirdly nodes need to be highly collaborative and redundant, but, most of all, cannot use complex algorithms or protocols. Our routing scheme is a combination of two protocols called Terminode Local Routing (TLR) and Terminode Remote Routing TRR). TLR is used to route packets to close destinations. TRR is used to route to remote destinations and is composed of the following elements: Anchored Geodesic Packet Forwarding (AGPF), Friend Assisted Path Discovery (FAPD), multipath routing and path maintenance. The combination of TLR and TRR has the following features: (1) it is highly scalable because every node relies only on itself and a small number of other nodes for packet forwarding; (2) it acts and reacts well to the dynamicity of the network because multipath routing is considered as a rule; and (3) it can be implemented and run in very simple devices because the algorithms and protocols are very simple and based on high collaboration. We have performed simulations of the TLR and TRR protocols in GloMoSim. The simulation results demonstrate that the routing protocol is able to deliver over 80% of user data in a large, highly mobile simulation environment whereas Dynamic Source Routing(DSR) achieves less than 10%

A Scalable Routing Method for Irregular Mobile Ad Hoc Networks

We designed the terminode routing protoc ol with the objective to scale in large mobile ad hoc networks where the topology, or node distribution, is irregular. Our routing protocol is a combination of two protocols: Terminode Local Routing (TLR - to reach a close destination) and Terminode Remot e Routing (TRR - to send data to remote destinations). TRR is the key element to achieve scalability and reduce dependence on intermediate systems. Termin-ode routing uses anchored paths, a list of geographic points - that are not affected by nodes mobili ty -, rather than conventional paths of nodes. Terminode routing is completed by a low-overhead distributed method for discovering of anchored paths, and by a method for handling the inaccuracy of the location information. The presented simu-lation result s confirm that terminode routing performs well in different sized networks. In smaller ad hoc networks performance of terminode routing is comparable to MANET routing protocols. In larger networks, where MANET-like routing protocols break, terminode routing performs well; moreover, in larger networks that are not uniformly populated with nodes, terminode routing outperforms the existing location-based routing protocols

Towards Mobile Ad-Hoc WANs: Terminodes

Terminodes are personal devices that provide functionality of both the terminals and the nodes of the network. A network of terminodes is an autonomous, fully self-organized, wireless network, independent of any infrastructure. It must be able to scale up to millions of units, without any fixed backbone or server. In this paper we present the main challenges and discuss the main technical directions

A Distributed and Robust Election Protocol using Multicast IP

We present in this paper a distributed protocol that provides an access control mechanism for IP multicast. The protocol distributes a right to multicast between multicast IP group members in a fair manner. The protocol constructs a control tree that includes every host member of a given multicast IP group. The protocol updates dynamically the control tree as group members join and leave the group. The protocol is scalable: the state information kept by each member is constant and independent of the group size and of the tree structure. The paper describes the protocol and its implementation